Symbolic computations in .NET Framework
نویسندگان
چکیده
The computer algebra system (CAS) is a software that is used for various symbolic computations like simplification and differentiation. CAS are based on the transformation rules that rearrange expressions according to the mathematical laws. We consider development of CAS in the .NET Framework. Currently, there is only one .NET software product with some features of symbolic computations, and no full-fledged implementation of the transformation rules in .NET. In the same time, the .NET framework provides many features for innovative techniques of rules’ development, and therefore a .NET solution for the transformation rules can offer the new approaches to the computer algebra systems. In this paper, we describe these techniques and their implementation.
منابع مشابه
Generic Access to Symbolic Computing Services
Symbolic computation is one of the computational domains that requires large computational resources. Computer Algebra Systems (CAS), the main tools used for symbolic computations, are mainly designed to be used as software tools installed on standalone machines that do not provide the required resources for solving large symbolic computation problems. In order to support symbolic computations ...
متن کاملToward the Integration of Numerical Computations into the OMSCS Framework
Computer algebra systems and automated theorem provers, which have complementary abilities, can be integrated to form an Open Mechanized Symbolic Computation System (OMSCS). This framework could be extended to integrate numerical computation systems. This paper aims at showing what problems can occur when dealing with numerical computations and what can be done to solve them or at least to prov...
متن کاملGeneralized Iteration Space 21 Dependence Analysis
A large body of literature has developed concerning the automatic parallelization of numerical programs, and a quite separate literature has developed concerning the parallelization of symbolic programs. Because many symbolic programs make heavy use of array data and iterative constructs, in addition to more \symbolic" language features like pointers and recursion, it is desirable to fuse these...
متن کاملFactorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actions. But even small real systems are never modeled directly as ordinary Petri nets: they use many high-level features that were designed as extensions of Petri nets. We focus here on two such features: colors and compo...
متن کاملReliable Scalable Symbolic Computation: The Design of SymGridPar2 pdfsubject=Proceedings of the 28th Symposium On Applied Computing, SAC 2013
Symbolic computation is an important area of both Mathematics and Computer Science, with many large computations that would benefit from parallel execution. Symbolic computations are, however, challenging to parallelise as they have complex data and control structures, and both dynamic and highly irregular parallelism. The SymGridPar framework has been developed to address these challenges on s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012